Non-universal Suffrage Selection Operators Favor Population Diversity in Genetic Algorithms

نویسندگان

  • Federico Divina
  • Maarten Keijzer
  • Elena Marchiori
چکیده

State-of-the-art concept learning systems based on genetic algorithms evolve a redundant population of individuals, where an individual is a partial solution that covers some instances of the learning set. In this context, it is fundamental that the population be diverse and that as many instances as possible be covered. The universal suffrage selection (US) operator is a powerful selection mechanism that addresses these two requirements. In this paper we compare experimentally the US operator with two variants, called Weighted US (WUS) and Exponentially Weighted US (EWUS), of this operator in the system ECL [1]. The US selection operator operates in two steps:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Knowledge Based Tabu Crossover In Genetic Algorithms

Genetic algorithms are optimisation algorithms and mimic the natural process of evolution. Important operators used in genetic algorithms are selection, crossover and mutation. Selection operator is used to select the individuals from a population to create a mating pool which will participate in reproduction process. Crossover and mutation operators are used to introduce diversity in the popul...

متن کامل

The project portfolio selection and scheduling problem: mathematical model and algorithms

This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...

متن کامل

A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems

The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection mechanism which utilizes the mate chromosome during selection is used. The second technique focu...

متن کامل

Dynamic and heuristic fuzzy connectives-based crossover operators for controlling the diversity and convergence of real-coded genetic algorithms

Genetic algorithms are adaptive methods which may be used as approximation heuristic for search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is the premature convergence, a premature stagnation of the search caused by the lack of diversity in...

متن کامل

Hill Climbing Based Hybrid Crossover in Genetic Algorithms

Genetic Algorithms are biologically inspired optimization algorithms. Performance of genetic algorithms mainly depends on type of genetic operators – Selection, Crossover, Mutation and Replacement used in it. Crossover operators are used to bring diversity in the population. This paper studies different crossover operators and then proposes a hybrid crossover operator that incorporates knowledg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003